Towards Fast Atomic Decomposition using Axiom Dependency Hypergraphs

نویسندگان

  • Francisco Martín-Recuerda
  • Dirk Walther
چکیده

Atomic decomposition of ontologies has been suggested as a tool to understand the modular structure of ontologies. It consists of a polynomial size representation of potentially exponentially many modules of an ontology. Tractable algorithms for computing the atomic decomposition for locality-based modules have been introduced, albeit leaving room for improvement in terms of running time. In this paper, we consider ontologies formulated in OWL-EL. We introduce a notion of an axiom dependency hypergraph for an ontology, which represents how axioms are included in locality-based modules. We use a standard algorithm from graph theory to compute strongly connected components of the axiom dependency hypergraph and show that such components correspond to atoms of the ontology. An empirical evaluation of the algorithm on large fragments of biomedical ontologies confirms a significant improvement in running time.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Axiom Dependency Hypergraphs for Fast Atomic Decomposition of Ontologies

In this paper we use directed hypergraphs to represent the locality-based dependencies between the axioms of an OWL ontology. We define a notion of an axiom dependency hypergraph, where axioms are represented as nodes and dependencies between axioms as hyperedges connecting possibly several nodes with one node. We show that a locality-based module of an ontology corresponds to a connected compo...

متن کامل

A Fast Method for Synthesis Magnesium Hydroxide Nanoparticles, Thermal Stable and Flame Retardant Poly vinyl alcohol Nanocomposite

Magnesium hydroxide nanostructures as an effective flame retardant were synthesized by a facile and rapid microwave reaction. The effect of different surfactants such as cationic, anionic and polymeric on the morphology of magnesium hydroxide nanostructures was investigated. Nanostructures were characterized by X-ray diffraction (XRD), scanning electron microscopy (SEM) and Fourier transform in...

متن کامل

The Ryōan-ji axiom for common knowledge on hypergraphs

The article studies common knowledge in communication networks with a fixed topological structure. It introduces a non-trivial principle, called the Ryōan-ji axiom, which captures logical properties of common knowledge of all protocols with a given network topology. A logical system, consisting of the Ryōan-ji axiom and two additional axioms, is proven to be sound and complete.

متن کامل

Enumeration of Unlabeled Directed Hypergraphs

We consider the enumeration of unlabeled directed hypergraphs by using Pólya’s counting theory and Burnside’s counting lemma. Instead of characterizing the cycle index of the permutation group acting on the hyperarc set A, we treat each cycle in the disjoint cycle decomposition of a permutation ρ acting on A as an equivalence class (or orbit) of A under the operation of the group generated by ρ...

متن کامل

A Correct Approach on Adding Criteria in the Analytic Hierarchy Process

This paper deals with addition besides deletion of indifferent or wash criteria on which the alternatives have equal performance in the Analytic Hierarchy Process (AHP) against the misguided argument as shortcoming of the AHP. In such case, it is noted that careful attention and a correct approach are required in order not to be led towards a wrong decision with rank reversal when composing pri...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013